TSTP Solution File: NUM016^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM016^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:07:15 EDT 2024
% Result : Theorem 0.20s 0.38s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM016^5 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 14:08:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.JRgTWkfGqd/Vampire---4.8_19783
% 0.20/0.36 % (20030)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.20/0.37 % (20030)Instruction limit reached!
% 0.20/0.37 % (20030)------------------------------
% 0.20/0.37 % (20030)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (20030)Termination reason: Unknown
% 0.20/0.37 % (20030)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (20030)Memory used [KB]: 1023
% 0.20/0.37 % (20030)Time elapsed: 0.002 s
% 0.20/0.37 % (20030)Instructions burned: 3 (million)
% 0.20/0.37 % (20030)------------------------------
% 0.20/0.37 % (20030)------------------------------
% 0.20/0.37 % (20028)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.20/0.37 % (20029)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.20/0.37 % (20026)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.20/0.37 % (20027)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.20/0.37 % (20032)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.20/0.37 % (20031)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.20/0.37 % (20033)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.20/0.37 % (20029)Instruction limit reached!
% 0.20/0.37 % (20029)------------------------------
% 0.20/0.37 % (20029)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (20029)Termination reason: Unknown
% 0.20/0.37 % (20029)Termination phase: Property scanning
% 0.20/0.37
% 0.20/0.37 % (20029)Memory used [KB]: 895
% 0.20/0.37 % (20029)Time elapsed: 0.003 s
% 0.20/0.37 % (20029)Instructions burned: 2 (million)
% 0.20/0.37 % (20029)------------------------------
% 0.20/0.37 % (20029)------------------------------
% 0.20/0.37 % (20033)Instruction limit reached!
% 0.20/0.37 % (20033)------------------------------
% 0.20/0.37 % (20033)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (20033)Termination reason: Unknown
% 0.20/0.37 % (20033)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (20033)Memory used [KB]: 5500
% 0.20/0.37 % (20033)Time elapsed: 0.004 s
% 0.20/0.37 % (20033)Instructions burned: 3 (million)
% 0.20/0.37 % (20033)------------------------------
% 0.20/0.37 % (20033)------------------------------
% 0.20/0.37 % (20027)Instruction limit reached!
% 0.20/0.37 % (20027)------------------------------
% 0.20/0.37 % (20027)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (20027)Termination reason: Unknown
% 0.20/0.37 % (20027)Termination phase: Saturation
% 0.20/0.37
% 0.20/0.37 % (20027)Memory used [KB]: 5500
% 0.20/0.37 % (20027)Time elapsed: 0.004 s
% 0.20/0.37 % (20027)Instructions burned: 4 (million)
% 0.20/0.37 % (20027)------------------------------
% 0.20/0.37 % (20027)------------------------------
% 0.20/0.37 % (20034)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on Vampire---4 for (2999ds/37Mi)
% 0.20/0.38 % (20032)First to succeed.
% 0.20/0.38 % (20028)Also succeeded, but the first one will report.
% 0.20/0.38 % (20032)Refutation found. Thanks to Tanya!
% 0.20/0.38 % SZS status Theorem for Vampire---4
% 0.20/0.38 % SZS output start Proof for Vampire---4
% 0.20/0.38 thf(func_def_1, type, factorial_plus_one: $i > $i).
% 0.20/0.38 thf(func_def_2, type, less: $i > $i > $o).
% 0.20/0.38 thf(func_def_3, type, prime: $i > $o).
% 0.20/0.38 thf(func_def_4, type, prime_divisor: $i > $i).
% 0.20/0.38 thf(func_def_5, type, divides: $i > $i > $o).
% 0.20/0.38 thf(f50,plain,(
% 0.20/0.38 $false),
% 0.20/0.38 inference(subsumption_resolution,[],[f48,f28])).
% 0.20/0.38 thf(f28,plain,(
% 0.20/0.38 ((prime @ (factorial_plus_one @ a)) != $true)),
% 0.20/0.38 inference(subsumption_resolution,[],[f27,f17])).
% 0.20/0.38 thf(f17,plain,(
% 0.20/0.38 ( ! [X1 : $i] : (((less @ X1 @ X1) != $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f7])).
% 0.20/0.38 thf(f7,plain,(
% 0.20/0.38 ! [X0] : (((less @ (prime_divisor @ X0) @ X0) = $true) | ((prime @ X0) = $true)) & ((prime @ a) = $true) & ! [X1] : ((less @ X1 @ X1) != $true) & ! [X2] : (((prime @ X2) = $true) | ((divides @ (prime_divisor @ X2) @ X2) = $true)) & ! [X3] : (((less @ (factorial_plus_one @ a) @ X3) = $true) | ((less @ a @ X3) != $true) | ((prime @ X3) != $true)) & ! [X4,X5] : (((less @ X4 @ X5) = $true) | ((divides @ X5 @ (factorial_plus_one @ X4)) != $true)) & ! [X6] : ((divides @ X6 @ X6) = $true) & ! [X7] : (((prime @ (prime_divisor @ X7)) = $true) | ((prime @ X7) = $true)) & ! [X8,X9] : (((less @ X9 @ X8) != $true) | ((less @ X8 @ X9) != $true)) & ! [X10] : ((less @ X10 @ (factorial_plus_one @ X10)) = $true) & ! [X11,X12,X13] : (((divides @ X11 @ X12) = $true) | ((divides @ X11 @ X13) != $true) | ((divides @ X13 @ X12) != $true)) & ! [X14,X15] : (((less @ X15 @ X14) != $true) | ((divides @ X14 @ X15) != $true))),
% 0.20/0.38 inference(rectify,[],[f6])).
% 0.20/0.38 thf(f6,plain,(
% 0.20/0.38 ! [X12] : (((less @ (prime_divisor @ X12) @ X12) = $true) | ((prime @ X12) = $true)) & ((prime @ a) = $true) & ! [X3] : ((less @ X3 @ X3) != $true) & ! [X0] : (((prime @ X0) = $true) | ((divides @ (prime_divisor @ X0) @ X0) = $true)) & ! [X8] : (((less @ (factorial_plus_one @ a) @ X8) = $true) | ((less @ a @ X8) != $true) | ((prime @ X8) != $true)) & ! [X15,X14] : (((less @ X15 @ X14) = $true) | ((divides @ X14 @ (factorial_plus_one @ X15)) != $true)) & ! [X7] : ((divides @ X7 @ X7) = $true) & ! [X9] : (((prime @ (prime_divisor @ X9)) = $true) | ((prime @ X9) = $true)) & ! [X2,X1] : (((less @ X1 @ X2) != $true) | ((less @ X2 @ X1) != $true)) & ! [X13] : ((less @ X13 @ (factorial_plus_one @ X13)) = $true) & ! [X4,X5,X6] : (((divides @ X4 @ X5) = $true) | ((divides @ X4 @ X6) != $true) | ((divides @ X6 @ X5) != $true)) & ! [X11,X10] : (((less @ X10 @ X11) != $true) | ((divides @ X11 @ X10) != $true))),
% 0.20/0.38 inference(flattening,[],[f5])).
% 0.20/0.38 thf(f5,plain,(
% 0.20/0.38 ~~(! [X0] : (((prime @ X0) = $true) | ((divides @ (prime_divisor @ X0) @ X0) = $true)) & ! [X1,X2] : (~((less @ X1 @ X2) = $true) | ~((less @ X2 @ X1) = $true)) & ! [X3] : ~((less @ X3 @ X3) = $true) & ! [X4,X5,X6] : (~((divides @ X6 @ X5) = $true) | ~((divides @ X4 @ X6) = $true) | ((divides @ X4 @ X5) = $true)) & ! [X7] : ((divides @ X7 @ X7) = $true) & ! [X8] : (((less @ (factorial_plus_one @ a) @ X8) = $true) | ~((less @ a @ X8) = $true) | ~((prime @ X8) = $true)) & ! [X9] : (((prime @ (prime_divisor @ X9)) = $true) | ((prime @ X9) = $true)) & ! [X10,X11] : (~((less @ X10 @ X11) = $true) | ~((divides @ X11 @ X10) = $true)) & ((prime @ a) = $true) & ! [X12] : (((less @ (prime_divisor @ X12) @ X12) = $true) | ((prime @ X12) = $true)) & ! [X13] : ((less @ X13 @ (factorial_plus_one @ X13)) = $true) & ! [X14,X15] : (((less @ X15 @ X14) = $true) | ~((divides @ X14 @ (factorial_plus_one @ X15)) = $true)))),
% 0.20/0.38 inference(fool_elimination,[],[f4])).
% 0.20/0.38 thf(f4,plain,(
% 0.20/0.38 ~~(! [X0] : ((divides @ (prime_divisor @ X0) @ X0) | (prime @ X0)) & ! [X1,X2] : (~(less @ X1 @ X2) | ~(less @ X2 @ X1)) & ! [X3] : ~(less @ X3 @ X3) & ! [X4,X5,X6] : (~(divides @ X6 @ X5) | ~(divides @ X4 @ X6) | (divides @ X4 @ X5)) & ! [X7] : (divides @ X7 @ X7) & ! [X8] : ((less @ (factorial_plus_one @ a) @ X8) | ~(less @ a @ X8) | ~(prime @ X8)) & ! [X9] : ((prime @ (prime_divisor @ X9)) | (prime @ X9)) & ! [X10,X11] : (~(less @ X10 @ X11) | ~(divides @ X11 @ X10)) & (prime @ a) & ! [X12] : ((less @ (prime_divisor @ X12) @ X12) | (prime @ X12)) & ! [X13] : (less @ X13 @ (factorial_plus_one @ X13)) & ! [X14,X15] : ((less @ X15 @ X14) | ~(divides @ X14 @ (factorial_plus_one @ X15))))),
% 0.20/0.38 inference(rectify,[],[f2])).
% 0.20/0.38 thf(f2,negated_conjecture,(
% 0.20/0.38 ~~(! [X0] : ((divides @ (prime_divisor @ X0) @ X0) | (prime @ X0)) & ! [X1,X0] : (~(less @ X1 @ X0) | ~(less @ X0 @ X1)) & ! [X0] : ~(less @ X0 @ X0) & ! [X0,X2,X1] : (~(divides @ X1 @ X2) | ~(divides @ X0 @ X1) | (divides @ X0 @ X2)) & ! [X0] : (divides @ X0 @ X0) & ! [X0] : ((less @ (factorial_plus_one @ a) @ X0) | ~(less @ a @ X0) | ~(prime @ X0)) & ! [X0] : ((prime @ (prime_divisor @ X0)) | (prime @ X0)) & ! [X1,X0] : (~(less @ X1 @ X0) | ~(divides @ X0 @ X1)) & (prime @ a) & ! [X0] : ((less @ (prime_divisor @ X0) @ X0) | (prime @ X0)) & ! [X0] : (less @ X0 @ (factorial_plus_one @ X0)) & ! [X0,X1] : ((less @ X1 @ X0) | ~(divides @ X0 @ (factorial_plus_one @ X1))))),
% 0.20/0.38 inference(negated_conjecture,[],[f1])).
% 0.20/0.38 thf(f1,conjecture,(
% 0.20/0.38 ~(! [X0] : ((divides @ (prime_divisor @ X0) @ X0) | (prime @ X0)) & ! [X1,X0] : (~(less @ X1 @ X0) | ~(less @ X0 @ X1)) & ! [X0] : ~(less @ X0 @ X0) & ! [X0,X2,X1] : (~(divides @ X1 @ X2) | ~(divides @ X0 @ X1) | (divides @ X0 @ X2)) & ! [X0] : (divides @ X0 @ X0) & ! [X0] : ((less @ (factorial_plus_one @ a) @ X0) | ~(less @ a @ X0) | ~(prime @ X0)) & ! [X0] : ((prime @ (prime_divisor @ X0)) | (prime @ X0)) & ! [X1,X0] : (~(less @ X1 @ X0) | ~(divides @ X0 @ X1)) & (prime @ a) & ! [X0] : ((less @ (prime_divisor @ X0) @ X0) | (prime @ X0)) & ! [X0] : (less @ X0 @ (factorial_plus_one @ X0)) & ! [X0,X1] : ((less @ X1 @ X0) | ~(divides @ X0 @ (factorial_plus_one @ X1))))),
% 0.20/0.38 file('/export/starexec/sandbox/tmp/tmp.JRgTWkfGqd/Vampire---4.8_19783',cNUM016_1)).
% 0.20/0.38 thf(f27,plain,(
% 0.20/0.38 ((prime @ (factorial_plus_one @ a)) != $true) | ((less @ (factorial_plus_one @ a) @ (factorial_plus_one @ a)) = $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f26])).
% 0.20/0.38 thf(f26,plain,(
% 0.20/0.38 ((less @ (factorial_plus_one @ a) @ (factorial_plus_one @ a)) = $true) | ((prime @ (factorial_plus_one @ a)) != $true) | ($true != $true)),
% 0.20/0.38 inference(superposition,[],[f15,f10])).
% 0.20/0.38 thf(f10,plain,(
% 0.20/0.38 ( ! [X10 : $i] : (((less @ X10 @ (factorial_plus_one @ X10)) = $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f7])).
% 0.20/0.38 thf(f15,plain,(
% 0.20/0.38 ( ! [X3 : $i] : (((less @ a @ X3) != $true) | ((prime @ X3) != $true) | ((less @ (factorial_plus_one @ a) @ X3) = $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f7])).
% 0.20/0.38 thf(f48,plain,(
% 0.20/0.38 ((prime @ (factorial_plus_one @ a)) = $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f44])).
% 0.20/0.38 thf(f44,plain,(
% 0.20/0.38 ($true != $true) | ((prime @ (factorial_plus_one @ a)) = $true)),
% 0.20/0.38 inference(superposition,[],[f43,f12])).
% 0.20/0.38 thf(f12,plain,(
% 0.20/0.38 ( ! [X7 : $i] : (((prime @ (prime_divisor @ X7)) = $true) | ((prime @ X7) = $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f7])).
% 0.20/0.38 thf(f43,plain,(
% 0.20/0.38 ((prime @ (prime_divisor @ (factorial_plus_one @ a))) != $true)),
% 0.20/0.38 inference(subsumption_resolution,[],[f42,f34])).
% 0.20/0.38 thf(f34,plain,(
% 0.20/0.38 ((less @ (factorial_plus_one @ a) @ (prime_divisor @ (factorial_plus_one @ a))) != $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f33])).
% 0.20/0.38 thf(f33,plain,(
% 0.20/0.38 ($true != $true) | ((less @ (factorial_plus_one @ a) @ (prime_divisor @ (factorial_plus_one @ a))) != $true)),
% 0.20/0.38 inference(superposition,[],[f11,f31])).
% 0.20/0.38 thf(f31,plain,(
% 0.20/0.38 ((less @ (prime_divisor @ (factorial_plus_one @ a)) @ (factorial_plus_one @ a)) = $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f29])).
% 0.20/0.38 thf(f29,plain,(
% 0.20/0.38 ((less @ (prime_divisor @ (factorial_plus_one @ a)) @ (factorial_plus_one @ a)) = $true) | ($true != $true)),
% 0.20/0.38 inference(superposition,[],[f28,f19])).
% 0.20/0.38 thf(f19,plain,(
% 0.20/0.38 ( ! [X0 : $i] : (((prime @ X0) = $true) | ((less @ (prime_divisor @ X0) @ X0) = $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f7])).
% 0.20/0.38 thf(f11,plain,(
% 0.20/0.38 ( ! [X8 : $i,X9 : $i] : (((less @ X9 @ X8) != $true) | ((less @ X8 @ X9) != $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f7])).
% 0.20/0.38 thf(f42,plain,(
% 0.20/0.38 ((prime @ (prime_divisor @ (factorial_plus_one @ a))) != $true) | ((less @ (factorial_plus_one @ a) @ (prime_divisor @ (factorial_plus_one @ a))) = $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f39])).
% 0.20/0.38 thf(f39,plain,(
% 0.20/0.38 ((prime @ (prime_divisor @ (factorial_plus_one @ a))) != $true) | ((less @ (factorial_plus_one @ a) @ (prime_divisor @ (factorial_plus_one @ a))) = $true) | ($true != $true)),
% 0.20/0.38 inference(superposition,[],[f15,f37])).
% 0.20/0.38 thf(f37,plain,(
% 0.20/0.38 ((less @ a @ (prime_divisor @ (factorial_plus_one @ a))) = $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f35])).
% 0.20/0.38 thf(f35,plain,(
% 0.20/0.38 ((less @ a @ (prime_divisor @ (factorial_plus_one @ a))) = $true) | ($true != $true)),
% 0.20/0.38 inference(superposition,[],[f14,f32])).
% 0.20/0.38 thf(f32,plain,(
% 0.20/0.38 ((divides @ (prime_divisor @ (factorial_plus_one @ a)) @ (factorial_plus_one @ a)) = $true)),
% 0.20/0.38 inference(trivial_inequality_removal,[],[f30])).
% 0.20/0.38 thf(f30,plain,(
% 0.20/0.38 ($true != $true) | ((divides @ (prime_divisor @ (factorial_plus_one @ a)) @ (factorial_plus_one @ a)) = $true)),
% 0.20/0.38 inference(superposition,[],[f28,f16])).
% 0.20/0.38 thf(f16,plain,(
% 0.20/0.38 ( ! [X2 : $i] : (((prime @ X2) = $true) | ((divides @ (prime_divisor @ X2) @ X2) = $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f7])).
% 0.20/0.38 thf(f14,plain,(
% 0.20/0.38 ( ! [X4 : $i,X5 : $i] : (((divides @ X5 @ (factorial_plus_one @ X4)) != $true) | ((less @ X4 @ X5) = $true)) )),
% 0.20/0.38 inference(cnf_transformation,[],[f7])).
% 0.20/0.38 % SZS output end Proof for Vampire---4
% 0.20/0.38 % (20032)------------------------------
% 0.20/0.38 % (20032)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.38 % (20032)Termination reason: Refutation
% 0.20/0.38
% 0.20/0.38 % (20032)Memory used [KB]: 5628
% 0.20/0.38 % (20032)Time elapsed: 0.010 s
% 0.20/0.38 % (20032)Instructions burned: 8 (million)
% 0.20/0.38 % (20032)------------------------------
% 0.20/0.38 % (20032)------------------------------
% 0.20/0.38 % (20025)Success in time 0.014 s
% 0.20/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------